FNFT: A Software Library for Computing Nonlinear Fourier Transforms
نویسندگان
چکیده
منابع مشابه
Linear and nonlinear generalized Fourier transforms.
This article presents an overview of a transform method for solving linear and integrable nonlinear partial differential equations. This new transform method, proposed by Fokas, yields a generalization and unification of various fundamental mathematical techniques and, in particular, it yields an extension of the Fourier transform method.
متن کاملNew algorithms for computing directional discrete Fourier transforms
New algorithms for computing the Discrete Fourier Transform (DFT) spectra along different directions are derived and implemented. For computing the DFT spectrum along any given direction (containing N DFT frequencies), a new algorithm is presented that requires N ( N 1 ) additions and a single 1-D FFT. As expected, for a single direction, the directional FFT algorithm is significantly faster th...
متن کاملA Characterization of Fourier Transforms
The aim of this paper is to show that, in various situations, the only continuous linear map that transforms a convolution product into a pointwise product is a Fourier transform. We focus on the cyclic groups Z/nZ, the integers Z, the Torus T and the real line. We also ask a related question for the twisted convolution. In memory of A. Hulanicki.
متن کاملLibrary Generation For Linear Transforms
The development of high-performance numeric libraries has become extraordinarily difficult due to multiple processor cores, vector instruction sets, and deep memory hierarchies. To make things worse, often each library has to be re-implemented and re-optimized, whenever a new platform is released. In this thesis we develop a library generator that completely automates the library development fo...
متن کاملA Parallel Algorithm For Computing Fourier Transforms On the Star Graph
Abstmcr-The n-star graph, denoted by S,, is one of the graph networks that have been recently proposed as attractive alternatives to the n-cube topology for interconnecting processors in parallel computers. In this paper, we present a parallel algorithm for the computation of the Fourier transform on the star graph. The algorithm requires O(n*)multiply-add steps for an input sequence of n! elem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Open Source Software
سال: 2018
ISSN: 2475-9066
DOI: 10.21105/joss.00597